Minimalk-rankings for prism graphs
نویسندگان
چکیده
منابع مشابه
Minimal k-rankings for prism graphs
We determine rank numbers for the prism graph P 2 ×C n (P 2 being the connected two-node graph and C n a cycle of length n) and for the square of an even cycle.
متن کاملRankings of Directed Graphs
A ranking of a graph is a coloring of the vertex set with positive integers such that on every path connecting two vertices of the same color there is a vertex of larger color. We consider the directed variant of this problem, where the above condition is imposed only on those paths in which all edges are oriented in the same direction. We show that the ranking number of a directed tree is boun...
متن کاملRankings of Graphs
A vertex (edge) coloring φ : V → {1, 2, . . . , t} (φ′ : E → {1, 2, . . . , t}) of a graph G = (V,E) is a vertex (edge) t-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The vertex ranking number χr(G) (edge ranking number χ′ r (G)) is the smallest value of t such that G has a vertex (edge) t-ranking. In this paper we...
متن کاملRadio numbers for generalized prism graphs
A radio labeling is an assignment c : V (G) → N such that every distinct pair of vertices u, v satisfies the inequality d(u, v) + |c(u) − c(v)| ≥ diam(G) + 1. The span of a radio labeling is the maximum value. The radio number of G, rn(G), is the minimum span over all radio labelings of G. Generalized prism graphs, denoted Zn,s, s ≥ 1, n ≥ s, have vertex set {(i, j) | i = 1, 2 and j = 1, . . . ...
متن کاملOptimal data collection for informative rankings expose well-connected graphs
Given a graph where vertices represent alternatives and arcs represent pairwise comparison data, the statistical ranking problem is to find a potential function, defined on the vertices, such that the gradient of the potential function agrees with the pairwise comparisons. Our goal in this paper is to develop a method for collecting data for which the least squares estimator for the ranking pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2010
ISSN: 1944-4176
DOI: 10.2140/involve.2010.3.183